Erratum to: n-Fold implicative basic logic is Gödel logic
نویسندگان
چکیده
منابع مشابه
Extending possibilistic logic over Gödel logic
In this paper we present several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Gödel logic formulas. Based on different characterizations of necessity measures on fuzzy sets, a group of logics with Kripke style semantics are built over a restricted language, namely a two level language composed of non-modal and modal formulas, the latter ...
متن کاملMonotone operators on Gödel logic
4 We consider an extension of Gödel logic by a unary operator that enables the addition of nonnegative reals to truth-values. Although its propositional fragment has a simple proof system, first-order validity is Π2-hard. We explain the close connection to Scarpellini’s result on Π2hardness of Łukasiewicz’s logic.
متن کاملExploring Extensions of Possibilistic Logic over Gödel Logic
In this paper we present completeness results of several fuzzy logics trying to capture different notions of necessity (in the sense of Possibility theory) for Gödel logic formulas. In a first attempt, based on different characterizations of necessity measures on fuzzy sets, a group of logics, with Kripke style semantics, are built over a restricted language, indeed a two level language compose...
متن کاملA connection between Similarity Logic Programming and Gödel Modal Logic
In this paper we relate two logical similarity-based approaches to approximate reasoning. One approach extends the framework of (propositional) classical logic programming by introducing a similarity relation in the alphabet of the language that allows for an extended unification procedure. The second approach is a many-valued modal logic approach where 3p is understood as approximately p. Here...
متن کاملA Resolution Mechanism for Prenex Gödel Logic
First order Gödel logic G∞, enriched with the projection operator 4—in contrast to other important t-norm based fuzzy logics, like Lukasiewicz and Product logic—is well known to be recursively axiomatizable. However, unlike in classical logic, testing (1-)unsatisfiability, i.e., checking whether a formula has no interpretation that assigns the designated truth value 1 to it, cannot be straightf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2011
ISSN: 1432-7643,1433-7479
DOI: 10.1007/s00500-011-0795-z